#include <iostream>
using namespace std;
typedef struct LNode
{
	int data;
	struct LNode *next;
}LNode, *LinkList;
void CreateBack(LinkList &L, int n)
{
	LNode *T = L;
	while(n--)
	{
		LNode *p = new LNode;
		cin >> p->data;
		p->next = T->next;
		T->next = p;
		T = p; 
	}
}
void Show(LinkList L)
{
	LNode *p = L->next;
	while(p)
	{
		cout << p->data << " ";
		p = p->next;
	}
	cout << endl; 
}
void Inverse(LinkList &L)
{
	LNode *p = L->next;
	L->next = NULL;
	while(p)
	{
		LNode *q = p;
		p = p->next;
		q->next = L->next;
		L->next = q;
	} 
}
int main()
{
	LinkList L;
	L = new LNode;
	L->next = NULL;
	int n; cin >> n;
	CreateBack(L, n);
	Inverse(L);
	Show(L);
	return 0;
}